A note on potentially K4-e graphical sequences
نویسنده
چکیده
A sequence S is potentially K4 e graphical if it has a realization containing a K4 e as a subgraph. Let 0'(K4 e, n) denote the smallest degree sum such that every n-term graphical sequence S with O'(S) 2: a(I{4 e, n) is potentially K4 e graphical. Gould, Jacobson, Lehel raised the problem of determining the value of 0'(K4 e, n). In this paper, we prove that 0'(K4 e, n) = 2[(317, 1)/2] for 17, 2: 7 and 17, = 4,5, and 0'(I<4 e, 6) = 20.
منابع مشابه
A ug 2 00 3 A note on potentially K 4 − e graphical sequences ∗
A sequence S is potentially K4 − e graphical if it has a realization containing a K4 − e as a subgraph. Let σ(K4 − e, n) denote the smallest degree sum such that every n-term graphical sequence S with σ(S) ≥ σ(K4 − e, n) is potentially K4 − e graphical. Gould, Jacobson, Lehel raised the problem of determining the value of σ(K4 − e, n). In this paper, we prove that σ(K4 − e, n) = 2[(3n− 1)/2] fo...
متن کامل1 7 Se p 20 07 The smallest degree sum that yields potentially K r + 1 − Z - graphical Sequences ∗
Let Km −H be the graph obtained from Km by removing the edges set E(H) of the graphH (H is a subgraph ofKm). We use the symbol Z4 to denote K4−P2. A sequence S is potentially Km−H-graphical if it has a realization containing aKm−H as a subgraph. Let σ(Km−H,n) denote the smallest degree sum such that every n-term graphical sequence S with σ(S) ≥ σ(Km − H,n) is potentially Km − H-graphical. In th...
متن کاملOn potentially (K4-e)-graphic sequences
In this paper, we characterize the potentially (K4 − e)-graphic sequences where K4 − e is the graph obtained from K4 by removing one edge. This characterization implies a theorem due to C. H. Lai (Australas. J. Combin. 24 (2001), 123–127) and a characterization of potentially C4graphic sequences due to R. Luo (Ars Combin. 64 (2002), 301–318).
متن کاملOn a Biggs-Smith self-dual (1024)-configuration
A construction based on the Biggs-Smith graph is shown to produce an edge-disjoint union of 102 copies of K4 forming a {K4, L(Q3)}K3 -ultrahomogeneous graph dressed as the non-line-graphical Menger graph of a self-dual (1024)-configuration. This stands in contrast to the selfdual (424)-configuration of [8], whose Menger graph is a non-line-graphical {K4, K2,2,2}K2 -ultrahomogeneous graph.
متن کامل1 O ct 2 00 7 On potentially K r + 1 − U - graphical Sequences
X iv :0 71 0. 04 09 v1 [ m at h. C O ] 1 O ct 2 00 7 On potentially Kr+1 − U -graphical Sequences Chunhui Lai, Guiying Yan 1 Department of Mathematics, Zhangzhou Teachers College, Zhangzhou, Fujian 363000, P. R. of CHINA. e-mail: [email protected] 2 Center of Graph Theory, Combinatorics and Network, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing 10008...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Australasian J. Combinatorics
دوره 24 شماره
صفحات -
تاریخ انتشار 2001